Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization
نویسندگان
چکیده
Reliable estimates for the condition number of a large, sparse, real matrix A are important in many applications. To get an approximation for the condition number κ(A), an approximation for the smallest singular value is needed. Standard Krylov subspaces are usually unsuitable for finding a good approximation to the smallest singular value. Therefore, we study extended Krylov subspaces which turn out to be ideal for the simultaneous approximation of both the smallest and largest singular value of a matrix. First, we develop a new extended Lanczos bidiagonalization method. With this method we obtain a lower bound for the condition number. Moreover, the method also yields probabilistic upper bounds for κ(A). The user can select the probability with which the upper bound holds, as well as the ratio of the probabilistic upper bound and the lower bound.
منابع مشابه
Probabilistic Upper Bounds for the Matrix Two-Norm
We develop probabilistic upper bounds for the matrix two-norm, the largest singular value. These bounds, which are true upper bounds with a userchosen high probability, are derived with a number of different polynomials that implicitly arise in the Lanczos bidiagonalization process. Since these polynomials are adaptively generated, the bounds typically give very good results. They can be comput...
متن کاملExtended Lanczos Bidiagonalization for Dimension Reduction in Information Retrieval
We describe an extended bidiagonalization scheme designed to compute low-rank approximations of very large data matrices. Its goal is identical to that of the truncated singular value decomposition, but it is significantly cheaper. It consists in an extension of the standard Lanczos bidiagonalization that improves its approximation capabilities, while keeping the computational cost reasonable. ...
متن کاملL-curve Curvature Bounds via Lanczos Bidiagonalization
The L-curve is often applied to determine a suitable value of the regularization parameter when solving ill-conditioned linear systems of equations with a right-hand side contaminated by errors of unknown norm. The location of the vertex of the L-curve typically yields a suitable value of the regularization parameter. However, the computation of the L-curve and of its curvature is quite costly ...
متن کاملAugmented Implicitly Restarted Lanczos Bidiagonalization Methods
New restarted Lanczos bidiagonalization methods for the computation of a few of the largest or smallest singular values of a large matrix are presented. Restarting is carried out by augmentation of Krylov subspaces that arise naturally in the standard Lanczos bidiagonalization method. The augmenting vectors are associated with certain Ritz or harmonic Ritz vectors. Computed examples show the ne...
متن کاملEstimation of the L-curve via Lanczos Bidiagonalization
The L-curve criterion is often applied to determine a suitable value of the regularization parameter when solving ill-conditioned linear systems of equations with a right-hand side contaminated by errors of unknown norm. However, the computation of the L-curve is quite costly for large problems; the determination of a point on the L-curve requires that both the norm of the regularized approxima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 37 شماره
صفحات -
تاریخ انتشار 2015